1980D - GCD-sequence - CodeForces Solution

from math import gcd

def solution():
    def find(non_coprime_seq):
        curr_gcd = 1
        return next((index for index in range(len(non_coprime_seq)-1) if not curr_gcd <= (curr_gcd := gcd(non_coprime_seq[index], non_coprime_seq[index+1]))), 0)

    num_elements = int(input())
    elements = list(map(int, input().split()))
    find_index = find(elements)
    return "YES" if find_index == 0 or any(find(elements[:remove_index] + elements[remove_index+1:]) == 0 for remove_index in range(find_index-1, (find_index+1)+1)) else "NO"

for _ in range(int(input())):
    print(solution())